On The Frobenius Condition Number of Positive Definite Matrices
نویسندگان
چکیده
منابع مشابه
PERRON-FROBENIUS THEORY ON THE NUMERICAL RANGE FOR SOME CLASSES OF REAL MATRICES
We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.
متن کاملGyrovector Spaces on the Open Convex Cone of Positive Definite Matrices
In this article we review an algebraic definition of the gyrogroup and a simplified version of the gyrovector space with two fundamental examples on the open ball of finite-dimensional Euclidean spaces, which are the Einstein and M"{o}bius gyrovector spaces. We introduce the structure of gyrovector space and the gyroline on the open convex cone of positive definite matrices and explore its...
متن کاملA Method for Generating Infinite Positive Self-adjoint Test Matrices and Riesz Bases
In this article we propose a method to easily generate infinite multi-index positive definite self-adjoint matrices as well as Riesz bases in suitable subspaces of L2(Rd). The method is then applied to obtain some classes of multi-index Toeplitz matrices which are bounded and strictly positive on 2(Zd). The condition number of some of these matrices is also computed.
متن کاملMinimizing the condition number of a positive definite matrix by completion
We consider the problem of minimizing the spectral condition number of a positive definite matrix by completion: min{cond( [ A BH B X ] ) : [ A BH B X ] positive definite}, where A is an n × n Hermitian positive definite matrix, B a p × n matrix and X is a free p× p Hermitian matrix. We reduce this problem to an optimization problem for a convex function in one variable. Using the minimal solut...
متن کاملSQP algorithms for solving Toeplitz matrix approximation problem
The problem we are interested in is the best approximation of a given matrix by a positive semi–definite symmetric Toeplitz matrix. Toeplitz matrices appear naturally in a variety of problems in engineering. Since positive semi–definite Toeplitz matrices can be viewed as shift invariant autocorrelation matrices, considerable attention has been paid to them, especially in the areas of stochastic...
متن کامل